On a Closure Concept in Claw-Free Graphs
نویسنده
چکیده
If G is a claw-free graph, then there is a graph cl(G) such that (i) G is a spanning subgraph of cl(G), (ii) cl(G) is a line graph of a triangle-free graph, and (iii) the length of a longest cycle in G and in cl(G) is the same. A suucient condition for hamiltonicity in claw-free graphs, the equivalence of some conjectures on hamiltonicity in 2-tough graphs and the hamiltonicity of 7-connected claw-free graphs are obtained as corollaries.
منابع مشابه
Strengthening the closure concept in claw-free graphs
We give a strengthening of the closure concept for claw-free graphs introduced by the second author in 1997. The new closure of a claw-free graph G de ned here is uniquely determined and preserves the value of the circumference of G. We present an in nite family of graphs with n vertices and 3 2 n 1 edges for which the new closure is the
متن کاملClosure operation for even factors on claw-free graphs
Ryjacek [Z. Ryjáček: On a closure concept in claw-free graphs. Journal of Combinatorial Theory Ser. B 70 (1997), 217-224] defined a powerful closure operation cl(G) on claw-free graphs G. Very recently, Ryjacek, Yoshimoto and the talker developed the closure operation cl (G) on claw-free graphs which preserves the (non)-existence of a 2-factor. In this talk, we introduce a closure operation cl(...
متن کاملClaw-free graphs with complete closure
We study some properties of the closure concept in claw-free graphs that was introduced by the rst author. It is known that G is hamiltonian if and only if its closure is hamiltonian, but, on the other hand, there are innnite classes of non-pancyclic graphs with pancyclic closure. We show several structural properties of claw-free graphs with complete closure and their clique cutsets and, using...
متن کاملThe edge-closure of a claw-free graph is the line graph of a multigraph
Ryjáček introduced a closure concept in claw-free graphs based on local completion at a locally connected vertex. He showed that the closure of a graph is the line graph of a triangle-free graph. Brousek and Holub gave an analogous closure concept of claw-free graphs, called the edge-closure, based on local completion at a locally connected edge. In this paper, it is shown that the edge-closure...
متن کاملClosure concept for 2-factors in claw-free graphs
We introduce a closure concept for 2-factors in claw-free graphs that generalizes the closure introduced by the first author. The 2-factor closure of a graph is uniquely determined and the closure operation turns a claw-free graph into the line graph of a graph containing no cycles of length at most 5 and no cycles of length 6 satisfying a certain condition. A graph has a 2-factor if and only i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comb. Theory, Ser. B
دوره 70 شماره
صفحات -
تاریخ انتشار 1997